#include<bits/stdc++.h>
using namespace std;
int a[1000000];
void solve(){
	int n;
	cin >> n;
	int sum = 0;
	int minn = 0x3f3f3f3f;
	int flag = 0;
	for(int i = 1;i <= n;i++){
		cin >> a[i];
		if(a[i] > 0) {
			minn = min(minn,a[i]);
			flag = 1;
		}
	}
	sort(a + 1,a + n + 1);
	//如果是非正数我们都取
	for(int i = 1;i <= n;i++){
		if(a[i] <= 0) sum++;
	}
	//存在正数
	if(flag){
		int temp = 0x3f3f3f3f;
		//考虑是否要取最小的正数
		for(int i = 2;i <= n;i++){
			if(a[i] > 0) break;
			temp = min(a[i] - a[i - 1],temp);
		}
		//非正数们的最小差值要大于等于最小的正数，才能sum+1
		for(int i = 1;i <= n;i++){
			if(temp >= minn){
				sum++;
				break;
			}
		}
	}
	
	cout << sum << "\n";
}
int main(){
	int t;
	cin >> t;
	while(t--) solve();
}